Exact and Approximate Weighted Model Integration with Probability Density Functions Using Knowledge Compilation
نویسندگان
چکیده
منابع مشابه
Stationary probability density functions: An exact result
An exact expression is obtained for the probability density function (pdf) of any quantity measured in a general stationary process, in terms of conditional expectations of time derivatives of the signal. This expression indicates that the conditional expectations of both the time derivative squared and of the second time derivative influence the shape of the pdf, including its tails. A previou...
متن کاملApproximate Knowledge Compilation : The First Order
Knowledge compilation procedures make a knowledge base more explicit so as make inference with respect to the compiled knowledge base tractable or at least more eecient. Most work to date in this area has been restricted to the propositional case, despite the importance of rst order theories for expressing knowledge concisely. Focusing on (LUB) approximate compilation (Selman and Kautz 1991), o...
متن کاملAn Analysis of Approximate Knowledge Compilation
Knowledge compilat ion is the process by which an in i t ia l theory w i th respect to which inference is intractable is transformed into one or more "approximate" or equivalent theories w i th respect to which inference can be performed efficiently. Selman and Kautz introduced Horn lowest upper bound (LUB) approximations in [SK91], and generalized them in [KS91; SK95] to a number of target lan...
متن کاملApproximate Model-Based Diagnosis Using Preference-Based Compilation
This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as is done by, for example, an ATMS, to compiling an approximate model. Approximate compilation overcomes the problem of space required for the compilation being worst-case exponential in particular model parameters, such as the p...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33017825